Average-case analysis of algorithms using Kolmogorov complexity
نویسندگان
چکیده
منابع مشابه
Average-Case Analysis Using Kolmogorov Complexity
This expository paper demonstrates how to use Kolmogorov complexity to do the average-case analysis via four examples, and exhibits a surprising property of the celebrated associated universal distribution. The four examples are: average case analysis of Heapsort 17, 15], average nni-distance between two binary rooted leave-labeled trees 20], compact routing in computer networks 3], average-cas...
متن کاملOptimal Representation in Average Using Kolmogorov Complexity
One knows from the Algorithmic Complexity Theory ’ [2-5,8, 141 that a word is incompressible on average. For words of pattern xm, it is natural to believe that providing x and m is an optimal average representation. On the contrary, for words like x @ y (i.e., the bit to bit x or between x and y), providing n and y is not an optimal description on average. In this work, we sketch a theory of av...
متن کاملAnalysis of Sorting Algorithms by Kolmogorov Complexity (A Survey)
Recently, many results on the computational complexity of sorting algorithms were obtained using Kolmogorov complexity (the incompressibility method). Especially, the usually hard average-case analysis is ammenable to this method. Here we survey such results about Bubblesort, Heapsort, Shellsort, Dobosiewicz-sort, Shakersort, and sorting with stacks and queues in sequential or parallel mode. Es...
متن کاملAutomatic Average { case Analysis of Algorithms
Many probabilistic properties of elementary discrete combinatorial structures of interest for the average{case analysis of algorithms prove to be decidable. This paper presents a general framework in which such decision procedures can be developed: It is based on a combination of generating function techniques for counting, and complex analysis techniques for asymptotic estimations. We expose h...
متن کاملAverage Case Analysis of Marking Algorithms
The Lindstrom marking algorithm uses bounded workspace. Its time complexity is O(n) in all cases, but it has been assumed that the average case time complexity is O(n lg n). It is proven that the average case time complexity is Θ(n). Similarly, the average size of the Wegbreit bit stack is shown to be Θ(n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Technology
سال: 2000
ISSN: 1000-9000,1860-4749
DOI: 10.1007/bf02950402